Platonic graph

См. также в других словарях:

• graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… …   Universalium

• Vertex-transitive graph — In mathematics, a vertex transitive graph is a graph G such that, given any two vertices v1 and v2 of G , there is some automorphism : f : V(G) → V(G) such that : f (v1) = v2. In other words, a graph is vertex transitive if its automorphism group …   Wikipedia

• combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …   Universalium

• Dodecahedron — Regular Dodecahedron (Click here for rotating model) Type Platonic solid Elements F = 12, E = 30 V = 20 (χ = 2) Faces by sides 12{5} …   Wikipedia

• Octahedron — For the album by The Mars Volta, see Octahedron (album). Regular Octahedron (Click here for rotating model) Type Platonic solid Elements F = 8, E = 12 V = 6 (χ = 2) Faces by sides …   Wikipedia

• Polyhedron — Polyhedra redirects here. For the relational database system, see Polyhedra DBMS. For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). Some Polyhedra Dodecahedron (Regular polyhedron) …   Wikipedia

• Cube — This article is about the geometric shape. For other uses, see Cube (disambiguation). Regular Hexahedron (Click here for rotating model) Type Platonic solid Elements F = 6, E = 12 V = 8 (χ = 2) …   Wikipedia

• Tetrahedron — For the academic journal, see Tetrahedron (journal). Regular Tetrahedron (Click here for rotating model) Type Platonic solid Elements F = 4, E = 6 V = 4 (χ = 2) Faces by s …   Wikipedia

• ADE classification — The simply laced Dynkin diagrams classify diverse mathematical objects. In mathematics, the ADE classification (originally A D E classifications) is the complete list of simply laced Dynkin diagrams or other mathematical objects satisfying… …   Wikipedia

• Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

• Hamiltonian path — This article is about the overall graph theory concept of a Hamiltonian path. For the specific problem of determining whether a Hamiltonian path or cycle exists in a given graph, see Hamiltonian path problem. A Hamiltonian cycle in a dodecahedron …   Wikipedia